Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
81	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.inf.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes
82	On Problems as Hard as CNF-SAT∗ Marek Cygan† Holger Dell‡ Jesper Nederlofk Add to Reading List Source URL: arxiv.org Language: English - Date: 2014-03-27 21:09:14 NP-complete problems Exponential time hypothesis Conjunctive normal form Boolean satisfiability problem Vertex cover Set cover problem Time complexity Graph coloring Independent set Theoretical computer science Computational complexity theory Applied mathematics
83	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Minimizing the Number of Arcs Linking a Permutation of Points in the Plane Stephane Durocher∗ Chris Gray† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:44 Applied mathematics Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Permutation Theoretical computer science Mathematics NP-complete problems
84	Proofs and Refutations, and Z3 Leonardo de Moura and Nikolaj Bjørner Microsoft Research Abstract Z3 [3] is a state-of-the-art Satisfiability Modulo Theories (SMT) solver freely available from Microsoft Research. It solv Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2009-07-21 19:11:06 Formal methods Metalogic Logic in computer science Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Conjunctive normal form Mathematical proof Mathematics Theoretical computer science Logic
85	Software Engineering and Automated Deduction Willem Visser Nikolaj Bjørner Natarajan Shankar Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2014-05-07 12:02:12 Formal methods Automated theorem proving Logic in computer science NP-complete problems Model checking Satisfiability Modulo Theories Boolean satisfiability problem KeY First-order logic Theoretical computer science Logic Mathematical logic
86	A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications by Emina Torlak Add to Reading List Source URL: homes.cs.washington.edu Language: English - Date: 2014-08-13 19:26:58 NP-complete problems Constraint programming Logic in computer science Propositional calculus Unsatisfiable core Electronic design automation Boolean satisfiability problem Symmetry Satisfiability Theoretical computer science Mathematics Applied mathematics
87	Applications and Challenges in Satisfiability Modulo Theories Leonardo de Moura Microsoft Research One Microsoft Way Redmond, WA 98052 Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-09-16 13:35:41 Formal methods Mathematics Electronic design automation Logic in computer science NP-complete problems Satisfiability Modulo Theories Z3 Boolean satisfiability problem First-order logic Theoretical computer science Constraint programming Applied mathematics
88	Models and Strategies for Variants of the Job Shop Scheduling Problem Diarmuid Grimes1 and Emmanuel Hebrard2,3 1 3 Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2011-09-27 04:15:08 Applied mathematics Mathematics Constraint programming Job shop scheduling Boolean satisfiability problem Open shop scheduling Scheduling Shifting bottleneck heuristic Operations research Theoretical computer science Mathematical optimization
89	On the Complexity of Immersed Normal Surfaces Benjamin A. Burton∗ ´ Eric Colin de Verdi`ere† Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2014-02-07 07:27:37 Geometric topology Surfaces Differential topology 3-manifolds Manifold Computational topology Triangulation Normal surface Boolean satisfiability problem Topology Geometry Mathematics
90	Scheduling and SAT Emmanuel Hebrard Toulouse Outline Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2014-02-17 02:59:42 Constraint programming Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Satisfiability NP-complete Model checking Theoretical computer science Applied mathematics Computational complexity theory

UPDATE